A new branch and bound algorithm for project scheduling with resource constraints
نویسندگان
چکیده
منابع مشابه
A Time-Oriented Branch-and-Bound Algorithm for Resource- Constrained Project Scheduling with Generalised Precedence Constraints
Resource-constrained project scheduling with generalised precedence constraints is a very general scheduling model with applications in areas such as make-to-order production planning. We describe a time-oriented branch-and-bound algorithm that uses constraint-propagation techniques which actively exploit the temporal and resource constraints of the problem in order to reduce the search space. ...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملA Genetic Algorithm and a Model for the Resource Constrained Project Scheduling Problem with Multiple Crushable Modes
Abstract: This paper presents an exact model and a genetic algorithm for the multi-mode resource constrained project scheduling problem with generalized precedence relations in which the duration of an activity is determined by the mode selection and the duration reduction (crashing) applied within the selected mode. All resources considered are renewable. The objective is to determine a mode, ...
متن کاملA Multi-objective optimization model for project scheduling with time-varying resource requirements and capacities
Proper and realistic scheduling is an important factor of success for every project. In reality, project scheduling often involves several objectives that must be realized simultaneously, and faces numerous uncertainties that may undermine the integrity of the devised schedule. Thus, the manner of dealing with such uncertainties is of particular importance for effective planning. A realistic sc...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1991
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-21-2-273-282